Configuration relocation and defragmentation for run-time reconfigurable computing
نویسندگان
چکیده
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the compute-intensive sections of an application to reconfigurable hardware, custom computing systems exhibit significant speedups over traditional microprocessors. However, this potential acceleration is limited by the requirement that the speedups provided must outweigh the considerable cost of reconfiguration. The ability to relocate and defragment configurations on an FPGA can dramatically decrease the overall reconfiguration overhead incurred by the use of the reconfigurable hardware. We therefore present hardware solutions to provide relocation and defragmentation support with a negligible area increase over a generic partially reconfigurable FPGA, as well as software algorithms for controlling this hardware. This results in factors of 8 to 12 improvement in the configuration overheads displayed by traditional serially programmed FPGAs.
منابع مشابه
Programming Architectures For Run-Time Reconfigurable Systems
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the compute-intensive sections of an application to reconfigurable hardware, custom computing systems exhibit significant speedups over traditional microprocessors. However, the number and frequency of these hardware-mapped sections of ...
متن کاملConfiguration Prefetching Techniques for Partial Reconfigurable Coprocessors with Relocation and Defragmentation
One of the major overheads for reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedup possible in this paradigm. In this paper we explore configuration prefetching techniques for reducing this overhead. By overlapping the configuration loadings with the computation on the host processor the reconfiguration overhead can be reduced...
متن کاملAbstract : Configuration Relocation and Defragmentation for Reconfigurable Computing
Configuration Relocation and Defragmentation for Reconfigurable Computing 1 The complete paper is available at http://www.ece.nwu.edu/~kati/publications.html Katherine Compton, James Cooley, Stephen Knol Department of Electrical and Computer Engineering Northwestern University Evanston, IL USA [email protected] Scott Hauck Department of Electrical Engineering University of Washington Seattle, WA...
متن کاملA New Approach to Assess Defragmentation Strategies in Dynamically Reconfigurable FPGAs
Fragmentation on dynamically reconfigurable FPGAs is a major obstacle to the efficient management of the logic space in reconfigurable systems. When resource allocation decisions have to be made at run-time a rearrangement may be necessary to release enough contiguous resources to implement incoming functions. The feasibility of run-time relocation depends on the processing time required to set...
متن کاملConfiguration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. However, the number and frequency of these hardware-mapped sections of code are limited by the requirement that the speedups provided must outweigh the considerable cost of configuration. Research has shown that the ability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 10 شماره
صفحات -
تاریخ انتشار 2002